Setting Due Dates and Scheduling Jobs to Maximize Customer Satisfaction and Profits
نویسندگان
چکیده
Dynamic job shop scheduling research has previously assumed that the probability of the customer placing an order is always one, implying that customers will place orders regardless of lead times quoted from the producer and customer lead time expectations. As firms increasingly compete on the basis of the delivery speed and reputation, the relative performance of quoted versus actual realized lead times will have a strong effect on whether the customer will place future orders or not. Previous research has not considered differing customer requirements or the impact on the customer’s subjective assessment of the overall purchase performance and subsequently on customer satisfaction and repurchases intentions. This paper formally integrates concepts from operations management, marketing, and consumer decision theory into a single due date scheduling framework in order to model the antecedents and consequences of customer satisfaction. We use the results on dynamic priority queues to propose the new way of quoting due dates by explicitly considering the customers lead time requirements. Simulation experiments reveal that job shop policies and machine capacities have significant impact on customer satisfaction and subsequently, on net profit. Finally, we show that dynamic due date quotation policy performs significantly better than several other policies previously tested in the literature.
منابع مشابه
Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملSingle Machine Scheduling Problem under Fuzzy Processing Time and Fuzzy Due Dates
In this paper, we propose n-jobs to be processed on Single Machine Scheduling Problem (SMSP) involving fuzzy processing time and fuzzy due dates. The different due dates for each job be considered which meet the demand of customer with more satisfaction level. The main objective of this paper is the total penalty cost to be minimum in the schedule of the jobs on the single machine. This cost is...
متن کاملScheduling with a due-window for acceptable lead-times
Due-dates are often determined during sales negotiations between customers and the sales team of the firm. In the preliminary (pre-sale) stage, the customer provides a time interval (due-window) of his preferred due-dates. This interval reflects acceptable leadtimes, which are functions of the customer resource constraints (e.g. storage or personnel limitations). If the due-dates are assigned e...
متن کاملIntegrated Due Date Setting and Scheduling on a Single Machine Considering an Unexpected Unavailability
In this paper, an integrated machine scheduling withits due date setting problem has been considered. It is assumed that the machine is subject to some kind of random unavailability. Due dates should be set in an attractive and reliable manner, implying that they should be short and possible to be met. To this end, first, long due dates are penalized in the objective function. Then, for each cu...
متن کاملA Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کامل